Scalably scheduling processes with arbitrary speedup curves
نویسندگان
چکیده
منابع مشابه
Scalably Scheduling Power-Heterogeneous Processors
We show that a natural online algorithm for scheduling jobs on a heterogeneous multiprocessor, with arbitrary power functions, is scalable for the objective function of weighted flow plus energy.
متن کاملScheduling Parallel Jobs with Linear Speedup
We consider a scheduling problem where a set of jobs is apriori distributed over parallel machines. The processing time of any job is dependent on the usage of a scarce renewable resource, e.g. personnel. An amount of k units of that resource can be allocated to the jobs at any time, and the more of that resource is allocated to a job, the smaller its processing time. The dependence of processi...
متن کاملMarkov Decision Processes with Arbitrary Reward Processes
We consider a learning problem where the decision maker interacts with a standard Markov decision process, with the exception that the reward functions vary arbitrarily over time. We show that, against every possible realization of the reward process, the agent can perform as well—in hindsight—as every stationary policy. This generalizes the classical no-regret result for repeated games. Specif...
متن کاملOn Packet Scheduling with Adversarial Jamming and Speedup
In Packet Scheduling with Adversarial Jamming packets of arbitrary sizes arrive over time to be transmitted over a channel in which instantaneous jamming errors occur at times chosen by the adversary and not known to the algorithm. The transmission taking place at the time of jamming is corrupt, and the algorithm learns this fact immediately. An online algorithm maximizes the total size of pack...
متن کاملQuantum speedup of classical mixing processes ∗
It is known that repeated measurements performed at uniformly random times enable the continuous-time quantum walk on a finite set S (using a stochastic transition matrix P as the time-independent Hamiltonian) to sample almost uniformly from S provided that P does. Here we show that the same phenomenon holds for other (discrete-time) walk variants and more general measurements types, then focus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2012
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2229163.2229172